Eulerian tour algorithms for data visualization and the PairViz package
نویسنده
چکیده
PairViz is an R package that produces orderings of statistical objects for visualization purposes. We abstract the ordering problem to one of constructing edge-traversals of (possibly weighted) graphs. PairViz implements various edge traversal algorithms which are based on Eulerian tours and Hamiltonian decompositions. We describe these algorithms, their PairViz implementation and discuss their properties and performance. We illustrate their application to two visualization problems, that of assessing rater agreement, and model comparison in regression.
منابع مشابه
Factors Affecting Information Search Behavior in Purchasing an Outbound Package Tour: A Thematic Analysis
The present study seeks to examine the factors affecting information search of heads of households in purchasing an outbound package tour. A sample of 60 academics and non-academics in the field of tourism was chosen. Sampling methods were judgmental and snowball sampling. In order to gather data, we used a semi-structured interview. Thematic analysis was applied for data analysis, and the col...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملAn Investigation of the Antecedents of Consumers' Confusion in Purchasing an Outbound Package tour in the City of Isfahan by Fuzzy Delphi Method
The concept of consumer confusion has gained a considerable attention in consumer behavior literature during recent years. However,it is considered as a relatively new concept in marketing, particularly in businesses that provide intangible products such as tourism. This study aimed to investigate factors that potentially influence consumer confusion proneness in purchasing outbound package tou...
متن کاملVisual Exploration of Self-Organizing Maps Using the Grand Tour and Linked Brushing
The Self-Organizing Map (SOM) is a popular and well-studied unsupervised learning technique. Much work has been done recently on visualizing the results of the SOM algorithm, using static non-interactive approaches. This paper presents two new SOM visualization methods, based on the grand tour and linked brushing. These new methods use animation to show progress of the algorithm in the input sp...
متن کاملThe Stochastic Eulerian Tour Problem
This paper defines the Stochastic Eulerian Tour Problem (SETP) and investigates several characteristics of this problem. Given an undirected Eulerian graph , a subset =) of the edges in E that require service, and a probability distribution for the number of edges in R that have to be visited in any given instance of the graph, the SETP seeks an a priori Eulerian tour of minimum expected length...
متن کامل